On Repeated Zero-Sum Games with Incomplete Information and Asymptotically Bounded Values
نویسنده
چکیده
We consider repeated zero-sum games with incomplete information on the side of Player 2 with the total payoff given by the non-normalized sum of stage gains. In the classical examples the value VN of such N-stage game is of the order of N or √ N as N → ∞. Our aim is to present a general framework for another asymptotic behavior of the value VN observed for the discrete version of the financial market model introduced by De Meyer and Saley. For this game Domansky and independently De Meyer with Marino found that VN remains bounded as N → ∞ and converges to the limiting value. This game is almost-fair, i.e. if Player 1 forgets his private information the value becomes zero. We describe a class of almost-fair games having bounded values in terms of an easy-checkable property of the auxiliary non-revealing game. We call this property the trigger property and it says that there exists an optimal strategy of Player 2 that is piecewise-constant as a function of a prior distribution p. Discrete market models have the trigger property. We show that for nontrigger almost-fair games with additional non-degeneracy condition VN is of the order of √ N .
منابع مشابه
Repeated Games with Incomplete Information on One Side: The Case of Different Discount Factors
Two players engage in a repeated game with incomplete information on one side, where the underlying stage-games are zero-sum. In the case where players evaluate their stage-payoffs by using different discount factors, the payoffs of the infinitely repeated game are typically non zero-sum. However, if players grow infinitely patient, then the equilibrium payoffs will sometimes approach the zero-...
متن کاملUsing or hiding private information? An experimental study of zero-sum repeated games with incomplete information
This paper studies the value of private information in strictly competitive interactions in which there is a trade-off between (i) the short-run gain of using information, and (ii) the long-run gain of concealing it. We implement simple examples from the class of zero-sum repeated games with incomplete information. While the empirical value of information does not always coincide with the theor...
متن کاملReputation and Bounded Memory in Repeated Games with Incomplete Information
Reputation and Bounded Memory in Repeated Games with Incomplete Information Daniel Monte 2007 This dissertation is a study of bounded memory and reputation in games. In the rst chapter we show that the optimal use of a nite memory may induce inertia and infrequent updating on a players behavior, sometimes for strategic reasons. The setting is a repeated cheap-talk game with incomplete inform...
متن کاملThe value of two-person zero-sum repeated games with incomplete information and uncertain duration
It is known that the value of a zero-sum infinitely repeated game with incomplete information on both sides need not exist [1]. It is proved that any number between the minmax and the maxmin of the zero-sum infinitely repeated game with incomplete information on both sides is the value of the long finitely repeated game where players’ information about the uncertain number of repetitions is asy...
متن کاملDecision Algorithms for Multiplayer Non-Cooperative Games of Incomplete Information
Extending the complexity results of Reif 1, 2] for two player games of incomplete information, this paper (also see 3]) presents algorithms for deciding the outcome for various classes of multiplayer games of incomplete information, i.e. deciding whether or not a team has a winning strategy for a particular game. Our companion paper (Peter-son, Reif, and Azhar 4]) shows that these algorithms ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Dynamic Games and Applications
دوره 8 شماره
صفحات -
تاریخ انتشار 2018